In search of advice for participants in matching markets which use the deferred-acceptance algorithm
نویسنده
چکیده
Many centralized entry-level labor markets use the firm-proposing deferred-acceptance (DA) algorithm to compute the matching that is implemented among workers and firms. We propose a definition of the strategic options a worker faces in the DA-algorithm. Then we develop a theory to advise workers who distinguish between the firms from which they believe not to receive a proposal, the firms from which they might receive a proposal, and the firms from which they certainly receive a proposal. If a worker is not able to deduce which new proposals she receives after having rejected others, then it is not profitable for her to submit a list that reverses the true ranking of any two acceptable firms. Furthermore, it is not beneficial for her to include a firm in her submitted list that is unacceptable to her. 2003 Elsevier Inc. All rights reserved. JEL classification: C78; D81; J44
منابع مشابه
Stable matching mechanisms are not obviously strategy-proof
Many two-sided matching markets, from labor markets to school choice programs, use a clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is well known to be strategy-proof for the applicants. Nonetheless, a growing amount of empirical evidence reveals that applicants misrepresent their preferences when this mechanism is used. This paper shows that no mechanism th...
متن کاملEssays on Matching Markets By
Matching markets are common methods to allocate resources around the world. There are two kinds of matching market: centralized matching market and decentralized matching market. In a centralized matching market, there is a clearing house that functions to collect information from market participants and uses the information to determine the allocation among the participants. In a decentralized...
متن کاملDynamic Matching Markets and the Deferred Acceptance Mechanism
Many matching markets are dynamic, with one side’s priorities often depending on previous allocations. This creates opportunities for manipulations that do not exist in static matching problems. The school-choice problem, for example, exhibits considerable student mobility and a priority system that favors incumbent students and their siblings. In such a dynamic environment, parents can manipul...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملApplication of an Improved Neural Network Using Cuckoo Search Algorithm in Short-Term Electricity Price Forecasting under Competitive Power Markets
Accurate and effective electricity price forecasting is critical to market participants in order to make an appropriate risk management in competitive electricity markets. Market participants rely on price forecasts to decide on their bidding strategies, allocate assets and plan facility investments. However, due to its time variant behavior and non-linear and non-stationary nature, electricity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Games and Economic Behavior
دوره 48 شماره
صفحات -
تاریخ انتشار 2004